An outer-approximation guided optimization approach for constrained neural network inverse problems
نویسندگان
چکیده
This paper discusses an outer-approximation guided optimization method for constrained neural network inverse problems with rectified linear units. The refer to problem find the best set of input values a given trained in order produce predefined desired output presence constraints on values. analyzes characteristics optimal solutions activation units and proposes algorithm by exploiting their characteristics. proposed comprises primal dual phases. phase incorporates neighbor curvatures outer-approximations expedite process. identifies utilizes structure local convex regions improve convergence solution. At last, computation experiments demonstrate superiority compared projected gradient method.
منابع مشابه
A Nonfeasible Quadratic Approximation Recurrent Neural Network for Equality Constrained Optimization Problems
Convex optimization techniques are widely used in the design and analysis of communication systems and signal processing algorithms. In this paper a novel recurrent neural network is presented for solving nonlinear strongly convex equality constrained optimization problems. The proposed neural network is based on recursive quadratic programming for nonlinear optimization, in conjunction with ho...
متن کاملGeneral Constrained Polynomial Optimization: an Approximation Approach
In this paper, we consider approximation algorithms for optimizing a generic multi-variate (inhomogeneous) polynomial function, subject to some fairly general constraints. The focus is on the design and analysis of polynomial-time approximation algorithms. First, we study the problem of maximizing a polynomial function over the Euclidean ball. A polynomialtime approximation algorithm is propose...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملA Wavelet Neural Network for Function Approximation and Network Optimization A WAVELET NEURAL NETWORK FOR FUNCTION APPROXIMATION AND NETWORK OPTIMIZATION
A new mapping network combined wavelet and neural networks is proposed. The algorithm consists of two process: the selfconstruction of networks and the minimization of errors. In the first process, the network structure is determined by using wavelet analysis. In the second process, the approximation errors are minimized. The merits of the proposed network are as follows: network optimization, ...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2021
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-021-01653-y